sequential machine造句

例句与造句

1. Another source is Taylor Booth in his 1967 book " Sequential Machines and Automata Theory ".
2. One of his fundamental works is " Sequential Machines and Automata Theory " ( 1967 ).
3. All of the following are called " sequential machine models " to distinguish them from " parallel machine models ".
4. His doctoral thesis was " A design algorithm for sequential machines and definability in monadic second-order arithmetic ."
5. As such Householder is preferred for dense matrices on sequential machines, whilst Givens is preferred on sparse matrices, and / or parallel machines.
6. It's difficult to find sequential machine in a sentence. 用sequential machine造句挺难的
7. There is no need to access external buses, main memory or internal caches during each operation as is the case with standard sequential machines.
8. Van Emde Boas ( 1990 ) calls these three plus the pointer machine " sequential machine " models, to distinguish them from " parallel random-access machine " models.
9. In the 1965 paper by Krohn and Rhodes, the proof of the theorem on the decomposition of finite automata ( or, equivalently sequential machines ) made extensive use of the algebraic semigroup structure.
10. He deliberately chose the ` simplest'category of sequential machines or automata : a somewhat ironical vindication of the French philosopher Descartes'supposition that all animals are only elaborate machines or " mechanisms ".
11. This problem can easily be solved in linear time on a sequential machine, but a parallel algorithm can do better : given processors, the problem can be solved in logarithmic time,, by the following pointer jumping algorithm:
12. In Moore's paper " Gedanken-experiments on Sequential Machines ", the ( n; m; p ) automata ( or machines ) S are defined as having n states, m input symbols and p output symbols.
13. With Claude Shannon, before and during his time at Bell Labs, he coauthored " Gedanken-experiments on sequential machines ", " Computability by Probabilistic Machines ", " Machine Aid for Switching Circuit Design ", and " Reliable Circuits Using Less Reliable Relays ".
14. Since the lifespan of each state is a real number ( more precisely, non-negative real ) or infinity, it is distinguished from discrete time systems, sequential machines, and Moore machines, in which time is determined by a tick time multiplied by non-negative integers.
15. Together with the register machine, the RAM, and the pointer machine the RASP makes up the four common sequential machine models, called this to distinguish them from the " parallel " models ( e . g . parallel random access machine ) [ cf . van Emde Boas ( 1990 ) ].
16. To understand this statement, it is necessary to consider a computer composed of several processors executing a concurrent system : some order of execution for the processors ( seeing as sequential machines ), and for each one of these processors, the execution order for the instructions must be the same specified by the concurrent program.